A Graph Grammar for Modelling RNA Folding
نویسندگان
چکیده
We propose a new approach for modelling the process of RNA folding as a graph transformation guided by the global value of free energy. Since the folding process evolves towards a configuration in which the free energy is minimal, the global behaviour resembles the one of a self-adaptive system. Each RNA configuration is a graph and the evolution of configurations is constrained by precise rules that can be described by a graph grammar.
منابع مشابه
Learning to design RNA polymers with graph kernels
RNA polymers have many functions in cells and are relatively easy to create. Finding ways to construct RNA sequences that correspond to a desired function is thus desirable. Conventionally inverse folding is used to tackle this problem. Inverse folding however is dependent on user provided very strict constraints. In this work I present an approach that will learn those constraints before gener...
متن کاملDynamic Programming for Set Data Types Electronic Supplement
A good example for Dynamic Programming over sequences is RNA folding. We consider here only a minimal example based on the grammar with non-terminals S and B denoting arbitrary structures and secondary structures enclosed by a base pair respectively. We write terminals in the usual shorthand notation as • for an unpaired base, while ( and ) denotes a base pair. There are just five productions i...
متن کاملModelling RNA folding under mechanical tension.
We investigate the thermodynamics and kinetics of RNA unfolding and refolding under mechanical tension. The hierarchical nature of RNA structure and the existence of thermodynamic parameters for base pair formation based on nearest-neighbour interactions allows modelling of sequence-dependent folding dynamics for any secondary structure. We calculate experimental observables such as the transit...
متن کاملAn Optimized Parsing Algorithm Well Suited to RNA Folding
The application of stochastic context-free grammars to the determination of RNA foldings allows a simple description of the sub-class of sought secondary structures, but it needs efficient parsing algorithms. The more classic thermodynamic model of folding, popularized by Zuker under the framework of dynamic programming algorithms, allows an easy computation of foldings but its use is delicate ...
متن کاملAsymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding.
We analyze the distribution of RNA secondary structures given by the Knudsen-Hein stochastic context-free grammar used in the prediction program Pfold. Our main theorem gives relations between the expected number of these motifs--independent of the grammar probabilities. These relations are a consequence of proving that the distribution of base pairs, of helices, and of different types of loops...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016